Computing the Fréchet distance between simple polygons
نویسندگان
چکیده
We present the first polynomial-time algorithm for computing the Fréchet distance for a non-trivial class of surfaces: simple polygons. For this, we show that it suffices to consider homeomorphisms that map an arbitrary triangulation of one polygon to the other polygon such that diagonals of the triangulation are mapped to shortest paths in the other polygon.
منابع مشابه
Partial Matching between Surfaces Using Fréchet Distance
Computing the Fréchet distance for surfaces is a surprisingly hard problem. It has been shown that it is NP-hard to compute the Fréchet distance between many nice classes of surfaces [God98], [Buc10]. On the other hand, a polynomial time algorithm exists for computing the Fréchet distance between simple polygons [Buc06]. This was the first paper to give an algorithm for computing the Fréchet di...
متن کاملComputing the Fréchet Distance Between Polygons with Holes
We study the problem of computing the Fréchet distance between subsets of Euclidean space. Even though the problem has been studied extensively for 1-dimensional curves, very little is known for d-dimensional spaces, for any d ≥ 2. For general polygons in R, it has been shown to be NP-hard, and the best known polynomial-time algorithm works only for polygons with at most a single puncture [Buch...
متن کاملComputing the Fréchet Distance between Folded Polygons
We present the first results showing that the Fréchet distance between non-flat surfaces can be approximated within a constant factor in polynomial time. Computing the Fréchet distance for surfaces is a surprisingly hard problem. It is not known whether it is computable, it has been shown to be NP-hard, and the only known algorithm computes the Fréchet distance for flat surfaces (Buchin et al.)...
متن کاملar X iv : 1 10 3 . 28 65 v 1 [ cs . C G ] 1 5 M ar 2 01 1 Computing the Fréchet Distance Between Folded Polygons 1
We present the first results showing that the Fréchet distance between non-flat surfaces can be approximated within a constant factor in polynomial time. Computing the Fréchet distance for surfaces is a surprisingly hard problem. It is not known whether it is computable, it has been shown to be NP-hard, and the only known algorithm computes the Fréchet distance for flat surfaces (Buchin et al.)...
متن کاملMapping Polygons to the Grid with Small Hausdorff and Fréchet Distance
We show how to represent a simple polygon P by a grid (pixel-based) polygon Q that is simple and whose Hausdorff or Fréchet distance to P is small. For any simple polygon P , a grid polygon exists with constant Hausdorff distance between their boundaries and their interiors. Moreover, we show that with a realistic input assumption we can also realize constant Fréchet distance between the bounda...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 41 شماره
صفحات -
تاریخ انتشار 2008